An Eecient Linear Abstract Machine with Single-pointer Property

We introduce xLIN, a novel linear abstract machine that introduces no penalty in computing with non-linear resources, while ensuring that computing with linear resources takes no space and constant time. Garbage collection is not required for linear objects, while still present for non-linear objects. We propose a weak calculus of explicit substitutions as its foundations, and show how it may be easily `derived' from it. We illustrate in which way our machine may be seen as a re nement of Krivine's abstract machine, and hint at how non-linear computation could be optimized to serve as framework for the implementation of functional languages.